Uncountable superperfect forcing and minimality
نویسندگان
چکیده
Uncountable superperfect forcing is tree forcing on regular uncountable cardinals κ with κ<κ = κ , using trees in which the heights of nodes that split along any branch in the tree form a club set, and such that any node in the tree with more than one immediate extension has measure-one-many extensions, where the measure is relative to some κ-complete, nonprincipal normal filter (or p-filter) F . This forcing adds a generic of minimal degree if and only if F is κ-saturated. c © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
On coding uncountable sets by reals
The following is our main result. Theorem 1.1 Suppose that A ⊆ ω1 and = [A]. Then there exists a cardinal preserving generic extension [x] of the ground universe by a generic real x such that (i) A ∈ [x] – this implies [x] = [x], and A ∈ Δ 1 (x) in [x], (ii) x is a minimal real over , that is, x ∈ , and if a set Y belongs to [x], then x ∈ [Y ] or Y ∈ , 1) (iii) there is a club C ∈ [x], C ⊆ ω1, ...
متن کاملProper forcing, cardinal arithmetic, and uncountable linear orders
In this paper I will communicate some new consequences of the Proper Forcing Axiom. First, the Bounded Proper Forcing Axiom implies that there is a well ordering of R which is Σ1-definable in (H(ω2),∈). Second, the Proper Forcing Axiom implies that the class of uncountable linear orders has a five element basis. The elements are X, ω1, ω∗ 1 , C, C ∗ where X is any suborder of the reals of size ...
متن کاملA Family of Trees with No Uncountable Branches
We construct a family of 2א1 trees of size א1 and no uncountable branches that in a certain way codes all ω1sequences of infinite subsets of ω. This coding allows us to conclude that in the presence of the club guessing between א1 and א0, these trees are pairwise very different. In such circumstances we can also conclude that the universality number of the ordered class of trees of size א1 with...
متن کاملCarlson Collapse is minimal under MA
Namba forcing [5] may be regarded as a generalization of Laver forcing [2] to ω2. The analogous forcing for ω1 we call the Carlson collapse. We first encountered it when writing our joint paper: Carlson, Kunen, and Miller [1]. In that paper we used the Prikry collapse of ω1, which is analogous to superperfect tree forcing (e.g., Miller [3]) but with subtrees of ω 1 . We proved in [1] the analog...
متن کاملCombinatorics on Ideals and Forcing
A natural generalization of Cohen's set of forcing conditions (the t w ~ valued functions with domain a finite subset of w) is the set of twovalued functions with domain an element of an ideal J on ~. The I~roblem treated in this paper is to determine when such forcing yields a generic real of minimal degree of constructibility. A :;imple decomposition argument shows that the non-maximality of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 144 شماره
صفحات -
تاریخ انتشار 2006